Computing Approximate Shortest Paths on Convex Polytopes1
نویسندگان
چکیده
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algorithm for computing approximate shortest paths on a convex polyhedral surface. Given a convex polyhedral surface P in R3, two points s, t ∈ P , and a parameter ε > 0, it computes a path between s and t on P whose length is at most (1 + ε) times the length of the shortest path between those points. It constructs in time O(n/√ε) a graph of size O(1/ε4), computes a shortest path on this graph, and projects the path onto the surface in O(n/ε) time, where n is the number of vertices of P . In the postprocessing step we have added a heuristic that considerably improves the quality of the resulting path.
منابع مشابه
Practical Methods for Approximating Shortest Paths on a Convex Polytope in R3
We propose a n extremely simple approximation scheme for computing shortest paths on the surface of a convex polytope in three dimensions. Given a convex polytope P with n vertices and two points p,q on its surface, let d{subscript p}(p,q) denote the shortest path distance between p and q on the surface of P. Our algorithm produces a path of length at most 2*d{subscript p}(p,q) in time O(n). Ex...
متن کاملApproximate Shortest Paths in Simple Polyhedra
Introduction Minimal paths in volume images have raised interest in computer vision and image analysis (for example, [4, 5]). In medical image analysis, minimal paths were extracted in 3D images and applied to virtual endoscopy [5]. The existed approximation algorithms for 3D ESP calculations are not efficient, see, for example, [2, 6]. Recently, [1] proposes algorithms for calculating approxim...
متن کاملApproximate Euclidean shortest paths amid convex obstacles
We develop algorithms and data structures for the approximate Euclidean shortest path problem amid a set P of k convex obstacles in R and R, with a total of n faces. The running time of our algorithms is linear in n, and the size and query time of our data structure are independent of n. We follow a “core-set” based approach, i.e., we quickly compute a small sketch Q of P whose size is independ...
متن کاملImproved Distributed Algorithms for Exact Shortest Paths
Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Henzinger, Krinninger, and Nanongkai [STOC’16] which deterministically computes (1 + o(1))-approximate shortest paths in Õ(D + √ n) time, where D is the h...
متن کاملAn approximative solution to the Zookeeper's Problem
Consider a simple polygon P containing disjoint convex polygons each of which shares an edge with P . The Zookeeper’s Problem then asks for the shortest route in P that visits all convex polygons without entering their interiors. Existing algorithms that solve this problem run in time super-linear in the size of P and the convex polygons. They also suffer from numerical problems. In this paper,...
متن کامل